AutoHyper: Explicit-State Model Checking for HyperLTL

Abstract HyperLTL is a temporal logic that can express hyperproperties, i.e., properties relate multiple execution traces of system. Such are becoming increasingly important and naturally occur, e.g., in information-flow control, robustness, mutation testing, path planning, causality checking. Thus far, complete model checking tools for have been limited to alternation-free formulas, formulas use only universal or existential trace quantification. Properties involving quantifier alternations could be handled an incomplete way, the verification might fail even though property holds. In this paper, we present , explicit-state automata-based checker supports full with arbitrary alternations. We show language inclusion checks integrated into verification, which allows benefit from range existing inclusion-checking tools. evaluate on broad set benchmarks drawn different areas literature compare it (incomplete) methods verification.